منابع مشابه
Improved Lower Bounds for the Orders of Even Girth Cages
The well-known Moore bound M(k, g) serves as a universal lower bound for the order of k-regular graphs of girth g. The excess e of a k-regular graph G of girth g and order n is the difference between its order n and the corresponding Moore bound, e = n −M(k, g). We find infinite families of parameters (k, g), g > 6 and even, for which we show that the excess of any k-regular graph of girth g is...
متن کاملChild Support Orders and Payments: Do Lower Orders Result in Higher Payments?
Wolf for assistance with the manuscript and colleagues at IRP for helpful comments. Any views expressed in this paper are those of the authors and not necessarily those of the sponsoring institutions.
متن کاملCausality , partial orders , and lower bounds on rounds for
An authentication protocol, as used in distributed systems, provides a mechanism for establishing secure channels to protect communications between nodes. Some notable recent works by Gong use the number of rounds as a communication complexity measure on authentication protocols|where a round consists of protocol messages that can be exchanged simultaneously. In this paper, we consider a more f...
متن کاملExpansions in Non-integer Bases: Lower, Middle and Top Orders
Let q ∈ (1, 2); it is known that each x ∈ [0, 1/(q− 1)] has an expansion of the form x = ∑∞ n=1 anq −n with an ∈ {0, 1}. It was shown in [4] that if q < ( √ 5 + 1)/2, then each x ∈ (0, 1/(q − 1)) has a continuum of such expansions; however, if q > (√5 + 1)/2, then there exist infinitely many x having a unique expansion [5]. In the present paper we begin the study of parameters q for which there...
متن کاملCircle Orders , N - gon Orders and the Crossing Number of Partial Orders
Let F={P1,...,Pm} be a family of sets. A partial order P(F, <) on F is naturally defined by the condition Pi< Pj iff Pi is contained in Pj. When the elements of F are disks (i.e. circles together with their interiors), P(F, <) is called a circle order; if the elements of F are n-polygons, P(F, <) is called an n-gon order. In this paper we study circle orders and n-gon orders. The crossing numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1964
ISSN: 0028-0836,1476-4687
DOI: 10.1038/203684a0